March_dl: Adding Adaptive Heuristics and a New Branching Strategy

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

March_dl: Adding Adaptive Heuristics and a New Branching Strategy

We introduce the march dl satisfiability (SAT) solver, a successor of march eq. The latter was awarded state-of-the-art in two categories during the Sat 2004 competition. The focus lies on presenting those features that are new in march dl. Besides a description, each of these features is illustrated with some experimental results. By extending the preprocessor, using adaptive heuristics, and b...

متن کامل

Fundaments of Branching Heuristics

The topic of this chapter is to provide foundations for “branching heuristics”. The whole field of “heuristics” is very diverse, and we will concentrate on a specific part, where developments in the last four decades can be comprised in what actually deserves to be called a “theory”. A full version of this chapter, containing all proofs and extensive examples, is available in [Kul08a]. The noti...

متن کامل

A New Adaptive Load-Shedding and Restoration Strategy for Autonomous Operation of Microgrids: A Real-Time Study

Islanding operation is one of the main features of a MicroGrid (MG), which is realized regarding the presence of distributed energy resources (DERs). However, in order to deal with the control challenges, which an MG faces during island operation, particularly when the transition is associated with certain excessive load, an efficient control strategy is required. This paper introduces a Centra...

متن کامل

The Interaction Between Inference and Branching Heuristics

We present a preprocessing algorithm for SAT, based on the HypBinRes inference rule, and show that it does not improve the performance of a DPLL-based SAT solver with conflict recording. We also present evidence that the ineffectiveness of the preprocessing algorithm is the result of interaction with the branching heuristic used by the solver.

متن کامل

construction and validation of a computerized adaptive translation test (a receptive based study)

آزمون انطباقی رایانه ای (cat) روشی نوین برای سنجش سطح علمی دانش آموزان می باشد. در حقیقت آزمون های رایانه ای با سرعت بالایی به سمت و سوی جایگزین عملی برای آزمون های کاغذی می روند (کینگزبری، هاوسر، 1993). مقاله حاضر به دنبال آزمون انطباقی رایانه ای برای ترجمه می باشد. بدین منظور دو پرسشنامه مشتمل بر 55 تست ترجمه میان 102 آزمودنی و 10 مدرس زبان انگلیسی پخش گردید. پرسشنامه اول میان 102 دانشجوی س...

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Journal on Satisfiability, Boolean Modeling and Computation

سال: 2006

ISSN: 1574-0617

DOI: 10.3233/sat190016